On the computation of rate-distortion functions (Corresp.)
نویسنده
چکیده
compression techniques,” in 1970 Int. Conf. Communications, pp. 20.14-20.21. [6] T. J. Lynch, “Compression of weather charts by the segmented Lynch-Davisson code,” IEEE Trans. Commun. (Corresp.), vol. COM-21, pp. 774-776, June 1973. [7] H. Meyr et al., “Optimum run length codes,” in 1973 Znt. Co& Communications, pp. 48.1948.25. [8] W. S. Michel et al., “A coded facsimile system,” in IRE Weston Conv. Rec., 1957, pp. 84-93. [9] W. S. Michel, “Statistical encoding for text and picture communication,” Commun. Electron., vol. 35, pp. 33-36,
منابع مشابه
Planelet Transform: A New Geometrical Wavelet for Compression of Kinect-like Depth Images
With the advent of cheap indoor RGB-D sensors, proper representation of piecewise planar depth images is crucial toward an effective compression method. Although there exist geometrical wavelets for optimal representation of piecewise constant and piecewise linear images (i.e. wedgelets and platelets), an adaptation to piecewise linear fractional functions which correspond to depth variation ov...
متن کاملOn Integral Operator and Argument Estimation of a Novel Subclass of Harmonic Univalent Functions
Abstract. In this paper we define and verify a subclass of harmonic univalent functions involving the argument of complex-value functions of the form f = h + ¯g and investigate some properties of this subclass e.g. necessary and sufficient coefficient bounds, extreme points, distortion bounds and Hadamard product.Abstract. In this paper we define and verify a subclass of harmonic univalent func...
متن کاملOn a linear combination of classes of harmonic $p-$valent functions defined by certain modified operator
In this paper we obtain coefficient characterization, extreme points and distortion bounds for the classes of harmonic $p-$valent functions defined by certain modified operator. Some of our results improve and generalize previously known results.
متن کاملComputation of channel capacity and rate-distortion functions
A&r&-By defining mutual information as a maximum over an appropriate space, channel capacities can be defined as double maxima and rate-distortion functions as double minima. This approach yields valuable new insights regarding the computation of channel capacities and rate-distortion functions. In particular, it suggests a simple algorithm for computing channel capacity that consists of a mapp...
متن کاملComputation-distortion characteristics of block transform coding
A distortion-computation function D(C) is de ned as the minimum expected distortion in computing some quantity while using no more than C computational units. In a communication framework, where the computational problem is to determine a representation that can be transmitted with expected rate not exceeding R, this gives slices of a rate-distortion-computation surface. The convexity of distor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 20 شماره
صفحات -
تاریخ انتشار 1974